|
The Zendian problem was an exercise in communication intelligence operations (mainly traffic analysis and cryptanalysis) devised by Lambros D. Callimahos as part of an advanced course, CA-400, that Callimahos taught to National Security Agency cryptanalysts starting in the 1950s. ==Content== The scenario involves 375 radio messages said to have been intercepted on December 23 by the US Army contingent of a United Nations force landed on the fictional island of Zendia in the Pacific Ocean. A typical intercept looks like this:
For each message, the first line is provided by the intercept operator, giving call signs, frequency, time, and reference number. The rest of the message is a transcript of the Morse code transmission. At the beginning of the intercepted message there is a header which consists of 8 four-digit groups. Initially, the meaning of the numeric header is not known; the meanings of various components of this header (such as a serial number assigned by the transmitting organization's message center) can be worked out through traffic analysis. The rest of the message consists of "indicators" and ciphertext; the first group is evidently a "discriminant" indicating the cryptosystem used, and (depending on the cryptosystem) some or all of the second group may contain a message-specific keying element such as initial rotor settings. The first two groups are repeated at the end of the message, which allows correction of garbled indicators. The remaining characters are encrypted text. Since the transmissions always use complete groups, "nulls" may have been used to pad out the text. Cryptosystems employed include transposition, dinome, and rotor-based ciphers and a one-part code. While these can be successfully tackled without use of a computer, solution is not easy. The practical exercise reinforces many basic principles, including ways to exploit having a ''collection'' of message traffic. A certain amount of cleartext inter-operator "chatter" is also provided, and may help with the analysis. Headers and discriminants are also given for intercepts from the next three days; these may be used for traffic analysis and in determining daily operating procedures. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Zendian problem」の詳細全文を読む スポンサード リンク
|